On Some Cosets of the First-Order Reed-Muller Code with High Minimum Weight
نویسنده
چکیده
We study a family of particular cosets of the first-order Reed–Muller code R(1;m): those generated by special codewords, the idempotents. Thus we obtain new maximal weight distributions of cosets of R(1; 7) and 84 distinct almost maximal weight distributions of cosets of R(1; 9), that is, with minimum weight 240. This leads to crypotographic applications in the context of stream ciphers.
منابع مشابه
On the weight distributions of optimal cosets of the first-order Reed-Muller codes
We study the weight distributions of cosets of the first-order Reed–Muller code (1 ) for odd , whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1 ) are obtained by partitioning its words according to their weight divisibility. Most notably, we show that there are exactly five weight distributions ...
متن کاملOn cryptographic properties of the cosets of R(1, m)
We introduce a new approach for the study of weight distributions of cosets of the Reed–Muller code of order 1. Our approach is based on the method introduced by Kasami in [1], using Pless identities. By interpreting some equations, we obtain a necessary condition for a coset to have a “high” minimum weight. Most notably, we are able to distinguish such cosets which have three weights only. We ...
متن کاملSteganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images
In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...
متن کاملCorrectable Errors of Weight Half the Minimum Distance for the First-Order Reed-Muller Codes
The number of correctable errors of weight half the minimum distance is given for the first-order binary Reed-Muller codes. It is shown that the size of trial set, which is introduced by Helleseth et al. and can be used for a minimum distance decoding or estimating the number of uncorrectable errors, for the first-order Reed-Muller codes is at least that of minimal codewords except for small code
متن کاملComplete Mutually Orthogonal Golay Complementary Sets From Reed-Muller Codes
Recently Golay complementary sets were shown to exist in the subsets of second-order cosets of a q-ary generalization of the first-order Reed–Muller (RM) code. We show that mutually orthogonal Golay complementary sets can also be directly constructed from second-order cosets of a q-ary generalization of the first-order RM code. This identification can be used to construct zero correlation zone ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 45 شماره
صفحات -
تاریخ انتشار 1999